Semisupervised Clustering for Networks Based on Fast Affinity Propagation
نویسندگان
چکیده
منابع مشابه
Affinity Propagation Clustering Using Path Based Similarity
Clustering is a fundamental task in data mining. Affinity propagation clustering (APC) is an effective and efficient clustering technique that has been applied in various domains. APC iteratively propagates information between affinity samples, updates the responsibility matrix and availability matrix, and employs these matrices to choose cluster centers (or exemplars) of respective clusters. H...
متن کاملFast Algorithm for Affinity Propagation
Affinity Propagation is a state-of-the-art clustering method recently proposed by Frey and Dueck. It has been successfully applied to broad areas of computer science research because it has much better clustering performance than traditional clustering methods such as k-means. In order to obtain high quality sets of clusters, the original Affinity Propagation algorithm iteratively exchanges rea...
متن کاملAdaptive Affinity Propagation Clustering
Affinity propagation clustering (AP) has two limitations: it is hard to know what value of parameter ‘preference’ can yield an optimal clustering solution, and oscillations cannot be eliminated automatically if occur. The adaptive AP method is proposed to overcome these limitations, including adaptive scanning of preferences to search space of the number of clusters for finding the optimal clus...
متن کاملBattery Grouping with Time Series Clustering Based on Affinity Propagation
Battery grouping is a technology widely used to improve the performance of battery packs. In this paper, we propose a time series clustering based battery grouping method. The proposed method utilizes the whole battery charge/discharge sequence for battery grouping. The time sequences are first denoised with a wavelet denoising technique. The similarity matrix is then computed with the dynamic ...
متن کاملDistributed and Incremental Clustering Based on Weighted Affinity Propagation
A new clustering algorithm Affinity Propagation (AP) is hindered by its quadratic complexity. The Weighted Affinity Propagation (WAP) proposed in this paper is used to eliminate this limitation, support two scalable algorithms. Distributed AP clustering handles large datasets by merging the exemplars learned from subsets. Incremental AP extends AP to online clustering of data streams. The paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2013
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2013/385265